import java.util.HashSet;
import java.util.Set;

/**
 * 和相等的子数组
 *
 * @USER: Administrator
 * @DATE: 2024/10/5 上午9:26
 * @VERSION: 1.0.0
 */
public class LC2395 {
    public static void main(String[] args) {

    }
    public boolean findSubarrays(int[] nums) {
        Set<Integer> set = new HashSet<>();
        for (int i = 0; i < nums.length-1; i++) {
            if (!set.add(nums[i]+nums[i+1])) {
                return true;
            }
        }
        return false;
    }
}
